منابع مشابه
Conceptual Graphs and First-Order Logic
Conceptual Structures (CS) Theory is a logic-based knowledge representation formalism. To show that conceptual graphs have the power of rst-order logic, it is necessary to have a mapping between both formalisms. A proof system, i.e. axioms and inference rules, for conceptual graphs is also useful. It must be sound (no false statement is derived from a true one) and complete (all possible tautol...
متن کاملConceptual Graphs and First Order Logic
We study Sowa’s conceptual graphs (CGs) with both existential and universal quantifiers. We explore in detail the existential fragment. We extend and modify Sowa’s original graph derivation system with new rules and prove the soundness and completeness theorem with respect to Sowa’s standard interpretation of CGs into first order logic (FOL). The proof is obtained by reducing the graph derivati...
متن کاملStrong conceptual completeness for first-order logic
By a strong conceptual completeness (XC) statement for a logical doctrine we mean an assertion that says that any theory of the doctrine can be recovered from an appropriate structure formed by the models of the theory. The expression ‘logical doctrine’ is used here as in [9] to mean a specific selection of logical operations giving rise to a notion of theory, in the form of a structured catego...
متن کاملFirst-Order Logic on CPDA Graphs
We contribute to the question about decidability of firstorder logic on configuration graphs of collapsible pushdown automata. Our first result is decidability of existential FO sentences on configuration graphs (and their ε-closures) of collapsible pushdown automata of order 3, restricted to reachable configurations. Our second result is undecidability of whole first-order logic on configurati...
متن کاملConceptual Clustering in a First Order Logic Representation
: We present the Conceptual Clustering system KBG. The knowledge representation language used, both for input and output, is based on first order logic with some extensions to handle quantitative and procedural knowledge. From a set of observations and a domain theory, KBG structures this information into a directed graph of concepts. This graph is generated by an iterative use of clustering an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2000
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/43.1.1